Inverse Problems with Second-order Total Generalized Variation Constraints
نویسندگان
چکیده
Total Generalized Variation (TGV) has recently been introduced as penalty functional for modelling images with edges as well as smooth variations [2]. It can be interpreted as a “sparse” penalization of optimal balancing from the first up to the kth distributional derivative and leads to desirable results when applied to image denoising, i.e., L-fitting with TGV penalty. The present paper studies TGV of second order in the context of solving ill-posed linear inverse problems. Existence and stability for solutions of Tikhonov-functional minimization with respect to the data is shown and applied to the problem of recovering an image from blurred and noisy data. Keywords— Total Generalized Variation, linear inverse problems, Tikhonov regularization, deblurring problem.
منابع مشابه
Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization
Splines come in a variety of flavors that can be characterized in terms of some differential operator L. The simplest piecewise-constant model corresponds to the derivative operator. Likewise, one can extend the traditional notion of total variation by considering more general operators than the derivative. This results in the definition of a generalized total variation semi-norm and of its cor...
متن کاملRegularization of linear inverse problems with total generalized variation
The regularization properties of the total generalized variation (TGV) functional for the solution of linear inverse problems by means of Tikhonov regularization are studied. Considering the associated minimization problem for general symmetric tensor fields, the wellposedness is established in the space of symmetric tensor fields of bounded deformation, a generalization of the space of functio...
متن کاملEpigraphical splitting for solving constrained convex formulations of inverse problems with proximal tools
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different, but possibly overlapping, blocks of the signal. For such constraints, the associated projection...
متن کاملEpigraphical splitting for solving constrained convex optimization problems with proximal tools – extended version
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different blocks of the linearly-transformed signal. For such constraints, the associated projection opera...
متن کاملThe Difference All-Difference Makes
We perform a comprehensive theoretical and experimental analysis of the use of all-different constraints. We prove that generalized arc-consistency on such constraints lies between neighborhood inverse consistency and, under a simple restriction, path inverse consistency on the binary representation of the problem. By generalizing the arguments of Kondrak and van Beek, we prove that a search al...
متن کامل